AbstractIn 1994, Cornuéjols and Novick published a classification of ideal and minimally non-ideal circulant clutters. One of their main results for doing so relates contractions of these clutters, simple directed cycles in an appropriate graph, and algebraic conditions. The purpose of this paper is twofold: to correct a small inaccuracy of the necessity of the algebraic conditions in the original proof, and to show that these algebraic conditions are actually sufficient, by giving a constructive proof of the existence of cycles
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractThe graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(modN) for some ...
For a clutter over ground set E, a pair of distinct elements e, f ∈ E are coexclusive if every minim...
AbstractIn 1994, Cornuéjols and Novick published a classification of ideal and minimally non-ideal c...
In 1994, Cornuéjols and Novick published a classification of ideal and minimally non-ideal circulant...
AbstractA well known family of minimally nonideal matrices is the family of the incidence matrices o...
We study the structure of the set covering polyhedron of circulant clutters, P (Cnk), especially the...
Lehman’s theorem on the structure of minimally nonideal clutters is a fundamental result in polyhedr...
Motivated by Lehman\u27s characterization of the minor-minimal clutters without the MFMC property, w...
AbstractMotivated by Lehman's characterization of the minor-minimal clutters without the MFMC proper...
AbstractIn this paper we define the class of near-ideal clutters following a similar concept due to ...
AbstractFor given positive integers n,a1,…,am, we consider the undirected circulant graph G=(V,E) wi...
AbstractThe Operations Research model known as the Set Covering Problem has a wide range of applicat...
Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that...
AbstractAn n × n zero-one matrix with constant column sums k is minimal if its determinant is ±k. A ...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractThe graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(modN) for some ...
For a clutter over ground set E, a pair of distinct elements e, f ∈ E are coexclusive if every minim...
AbstractIn 1994, Cornuéjols and Novick published a classification of ideal and minimally non-ideal c...
In 1994, Cornuéjols and Novick published a classification of ideal and minimally non-ideal circulant...
AbstractA well known family of minimally nonideal matrices is the family of the incidence matrices o...
We study the structure of the set covering polyhedron of circulant clutters, P (Cnk), especially the...
Lehman’s theorem on the structure of minimally nonideal clutters is a fundamental result in polyhedr...
Motivated by Lehman\u27s characterization of the minor-minimal clutters without the MFMC property, w...
AbstractMotivated by Lehman's characterization of the minor-minimal clutters without the MFMC proper...
AbstractIn this paper we define the class of near-ideal clutters following a similar concept due to ...
AbstractFor given positive integers n,a1,…,am, we consider the undirected circulant graph G=(V,E) wi...
AbstractThe Operations Research model known as the Set Covering Problem has a wide range of applicat...
Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that...
AbstractAn n × n zero-one matrix with constant column sums k is minimal if its determinant is ±k. A ...
AbstractÁdám's conjecture [1] formulates necessary and sufficient conditions for cyclic (circulant) ...
AbstractThe graph G(N,d) has vertex set V={0,1,…,N−1}, with {v,w} an edge if v−w≡±di(modN) for some ...
For a clutter over ground set E, a pair of distinct elements e, f ∈ E are coexclusive if every minim...